Linear Balanceable and Subcubic Balanceable Graphs

نویسندگان

  • Pierre Aboulker
  • Marko Radovanovic
  • Nicolas Trotignon
  • Théophile Trunck
  • Kristina Vuskovic
چکیده

In [Structural properties and decomposition of linear balanced matrices, Mathematical Programming, 55:129–168, 1992], Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of a cycle. We prove this conjecture for balanced bipartite graphs that do not contain a cycle of length 4 (also known as linear balanced bipartite graphs), and for balanced bipartite graphs whose maximum degree is at most 3. We in fact obtain results for more general classes, namely linear balanceable and subcubic balanceable graphs. Additionally, we prove that cubic balanced graphs contain a pair of twins, a result that was conjectured by Morris, Spiga and Webb in [Balanced Cayley graphs and balanced planar graphs, Discrete Mathematics, 310:3228–3235, 2010]. ∗Université Paris 7, LIAFA, Case 7014, 75205 Paris Cedex 13, France. E-mail: [email protected]. †Faculty of Computer Science (RAF), Union University, Knez Mihailova 6/VI, 11000 Belgrade, Serbia. E-mail: [email protected]. Partially supported by Serbian Ministry of Education and Science project 174033. ‡CNRS, LIP, ENS Lyon, INRIA, Université de Lyon, 15 parvis René Descartes BP 7000 69342 Lyon cedex 07 France. E-mail: [email protected]. §ENS Lyon, LIP, CNRS, INRIA, Université de Lyon, 15 parvis René Descartes BP 7000 69342 Lyon cedex 07 France. E-mail: [email protected]. ¶School of Computing, University of Leeds, Leeds LS2 9JT, UK and Faculty of Computer Science (RAF), Union University, Knez Mihailova 6/VI, 11000 Belgrade, Serbia. E-mail: [email protected]. Partially supported by EPSRC grant EP/H021426/1 and Serbian Ministry of Education and Science projects 174033 and III44006. The first four authors are partially supported by Agence Nationale de la Recherche under reference anr 10 jcjc 0204 01. All five authors are partially supported by PHC Pavle Savić grant 2010-2011, jointly awarded by EGIDE, an agency of the French Ministère des Affaires étrangères et européennes, and Serbian Ministry of Education and Science.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Quasi-Balanceable Class of Linear Quantum Stochastic Systems

This paper concerns the recently proposed quasi-balanced truncation model reduction method for linear quantum stochastic systems. It has previously been shown that the quasi-balanceable class of systems (i.e. systems that can be truncated via the quasi-balanced method) includes the class of completely passive systems. In this work, we refine the previously established characterization of quasi-...

متن کامل

Recognizing Balanceable Matrices

A 0/ ± 1 matrix is balanced if it does not contain a square submatrix with exactly two nonzero entries per row and per column in which the sum of all entries is 2 modulo 4. A 0/1 matrix is balanceable if its nonzero entries can be signed ±1 so that the resulting matrix is balanced. A signing algorithm due to Camion shows that the problems of recognizing balanced 0/ ± 1 matrices and balanceable ...

متن کامل

The world of hereditary graph classes viewed through Truemper configurations

In 1982 Truemper gave a theorem that characterizes graphs whose edges can be labeled so that all chordless cycles have prescribed parities. The characterization states that this can be done for a graph G if and only if it can be done for all induced subgraphs of G that are of few specific types, that we will call Truemper configurations. Truemper was originally motivated by the problem of obtai...

متن کامل

Distributed strategies for generating weight-balanced and doubly stochastic digraphs

This paper deals with the design and analysis of dynamical systems on directed graphs (digraphs) that achieve weight-balanced and doubly stochastic assignments. Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of coordination problems, including formation control, agreement, and distributed optimization. We refer to a digraph as...

متن کامل

Oriented Hypergraphs: Introduction and Balance

An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented hypergraphs. Oriented hypergraphs are further decomposed into three families – balanced, balanceable, and unbalanceable – and we obtain a complete classificati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 75  شماره 

صفحات  -

تاریخ انتشار 2014